Randomness and universal machines
نویسندگان
چکیده
منابع مشابه
Randomness and Universal Machines
The present work investigates several questions from a recent survey of Miller and Nies related to Chaitin’s Ω numbers and their dependence on the underlying universal machine. It is shown that there are universal machines for which ΩU is just ∑ x 2 1−H(x). For such a universal machine there exists a co-r.e. set X such that ΩU [X] = ∑ p:U(p)↓∈X 2 −|p| is neither left-r.e. nor Martin-Löf random....
متن کاملUniversal security for randomness expansion
We show that any spatially separated multi-part quantum device demonstrating nonlocality can be used in an untrusted-device protocol for randomness expansion with unconditional quantum security. A consequence is that the noise tolerance for secure randomness expansion only needs to be small enough that it rules out deterministic behavior of the device. This greatly reduces the requirement on im...
متن کاملUniversal test for Hippocratic randomness
Hippocratic randomness is defined in a similar way to Martin-Löf randomness, however it does not assume computability of the probability and the existence of universal test is not assured. We introduce the notion of approximation of probability and show the existence of the universal test (Levin-Schnorr theorem) for Hippocratic randomness when the logarithm of the probability is approximated wi...
متن کاملUniversal Learning Machines
All existing learning methods have particular bias that makes them suitable for specific kind of problems. Universal Learning Machine (ULM) should find the simplest data model for arbitrary data distributions. Several ways to create ULMs are outlined, and an algorithm based on creation of new global and local features combined with meta-learning is introduced. This algorithm is able to find sim...
متن کاملSmall Universal Turing Machines
Let UTM(m,n) be the class of universal Turing machine with m states and n symbols. Universal Turing machines are proved to exist in the following classes: UTM(24,2), UTM( 10,3), UTM(7,4), UTM(5,5), UTM(4,6), UTM(3,lO) and UTM(2,18).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2006
ISSN: 0885-064X
DOI: 10.1016/j.jco.2006.05.001